Diagonals of continuous triangular
نویسندگان
چکیده
Diagonals of continuous t-norms are studied. The characterization of all functions being diagonals of continuous t-norms is given. To a given diagonal, the class of all continuous t-norms with this diagonal is characterized.
منابع مشابه
Quality Meshing of 2D Images with Guarantees Derived by a Computer-Assisted Proof
This paper describes an algorithm for generating unstructured triangular meshes from a continuous two-dimensional object represented by an image. The algorithm uses squares as a background grid from which to build the quadrilateral elements that conform to the input contours. Then the triangulation is obtained by automatically choosing the diagonals that optimize the angles of the triangles. Th...
متن کاملDerivations on dual triangular Banach algebras
Ideal Connes-amenability of dual Banach algebras was investigated in [17] by A. Minapoor, A. Bodaghi and D. Ebrahimi Bagha. They studied weak∗continuous derivations from dual Banach algebras into their weak∗-closed two- sided ideals. This work considers weak∗-continuous derivations of dual triangular Banach algebras into their weak∗-closed two- sided ideals . We investigate when weak∗continuous...
متن کاملIntroducing Triangular Fuzzy Process Capability Indices to Evaluate Performance of Continuous Production Process
Process capability indices (PCIs) can be used as an effective tool for measuring product quality and process performance. In classic quality control there are some limitations which prevent a deep and flexible analysis because of the crisp definition of PCA‟s parameters. Fuzzy set theory can be used to add more flexibility to process capability analyses. In this study, the fuzzy X ba and MRx ba...
متن کاملArrangements of Lines with a Large Number of Triangles
An arrangement of lines is constructed by choosing n diagonals of the regular 2/i-gon. This arrangement is proved to form at least n(n 3)/3 triangular cells.
متن کاملA note on the error analysis of classical Gram –
An error analysis result is given for classical Gram–Schmidt factorization of a full rank matrix A into A = QR where Q is left orthogonal (has orthonormal columns) and R is upper triangular. The work presented here shows that the computed R satisfies R R = A A + E where E is an appropriately small backward error, but only if the diagonals of R are computed in a manner similar to Cholesky factor...
متن کامل